Parameterized Pattern Matching: Algorithms and Applications
نویسندگان
چکیده
منابع مشابه
Parameterized Pattern Matching - Succinctly
The fields of succinct data structures and compressed text indexing have seen quite a bit of progress over the last 15 years. An important achievement, primarily using techniques based on the Burrows-Wheeler Transform (BWT), was obtaining the full functionality of suffix tree in the optimal number of bits. A crucial property that allows the use of BWT for designing compressed indexes is order-p...
متن کاملOn the Study of Tree Pattern Matching Algorithms and Applications
Solving Tree Pattern Query problem is the central part of XML database query. This thesis presents several new algorithms to solve Tree Pattern Query problem and its variations. All of them have better time complexity than any existing algorithms. This thesis also describes the design, implementation, and application of two new algorithms to detect cloned code. The algorithms operate on the abs...
متن کاملLinear Pattern Matching Algorithms
In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but sub-optimal algorithms. In this paper, we introduce an interesting data structure called a bi-tree. A linear time algorithm "for obtaining a compacted version of a bi-tree associated with a given string is pr...
متن کاملOptimal pattern matching algorithms
We study a class of finite state machines, called w-matching machines, which yield to simulate the behavior of pattern matching algorithms while searching for a pattern w. They can be used to compute the asymptotic speed, i.e. the limit of the expected ratio of the number of text accesses to the length of the text, of algorithms while parsing an iid text to find the pattern w. Defining the orde...
متن کاملNew Pattern Matching Algorithms for Network Security Applications
OF THE DISSERTATION New Pattern Matching Algorithms for Network Security Applications by Liu Yang Dissertation Director: Vinod Ganapathy Modern network security applications, such as network-based intrusion detection systems (NIDS) and firewalls, routinely employ deep packet inspection to identify malicious traffic. In deep packet inspection, the contents of network packets are matched against ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1996
ISSN: 0022-0000
DOI: 10.1006/jcss.1996.0003